Time complexity

Results: 894



#Item
21VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

Add to Reading List

Source URL: www.vsgc.odu.edu

Language: English - Date: 2013-05-02 13:43:42
22Computing Fundamentals Computational Complexity Salvatore Filippone–2015

Computing Fundamentals Computational Complexity Salvatore Filippone–2015

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2015-06-11 10:49:26
23Taking Roots over High Extensions of Finite Fields ´ Eric Schost

Taking Roots over High Extensions of Finite Fields ´ Eric Schost

Add to Reading List

Source URL: www.csd.uwo.ca

Language: English - Date: 2011-11-11 00:09:18
24Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Online Algorithms: A Study of Graph-Theoretic Concepts Susanne Albers Max-Planck-Institut fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany. , http://www.mpi-sb.mpg.de/~ albers/

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:02
25doi:j.ins

doi:j.ins

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Language: English - Date: 2008-10-22 02:35:21
26SUMMARY OF FINDINGS BRINGING DEXTERITY TO IT COMPLEXITY What’s Helping or Hindering Tech Professionals Frontline IT workers around the globe say they’re struggling to implement transformational technologies at their

SUMMARY OF FINDINGS BRINGING DEXTERITY TO IT COMPLEXITY What’s Helping or Hindering Tech Professionals Frontline IT workers around the globe say they’re struggling to implement transformational technologies at their

Add to Reading List

Source URL: transformbiz.org

Language: English - Date: 2015-12-01 20:01:56
27A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Add to Reading List

Source URL: tandy.cs.illinois.edu

Language: English - Date: 2015-04-08 19:35:45
28The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2003-12-08 11:12:51
29Programmazione di sistemi multicore A.ALECTURE 9  IRENE FINOCCHI

Programmazione di sistemi multicore A.ALECTURE 9 IRENE FINOCCHI

Add to Reading List

Source URL: twiki.di.uniroma1.it

Language: English - Date: 2015-10-20 10:11:48
30Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:57